71![Sage Reference Manual: Matroid Theory Release 6.6.beta0 The Sage Development Team Sage Reference Manual: Matroid Theory Release 6.6.beta0 The Sage Development Team](https://www.pdfsearch.io/img/281c036eb83f059133d9f36312f1e489.jpg) | Add to Reading ListSource URL: sagemath.orgLanguage: English - Date: 2015-02-21 07:35:22
|
---|
72![To appear in 13th International Conference on Computer Vision, 6-13 November 2011, Barcelona, Spain. Image Segmentation by Figure-Ground Composition into Maximal Cliques Adrian Ion∗, Joao Carreira, Cristian Sminchises To appear in 13th International Conference on Computer Vision, 6-13 November 2011, Barcelona, Spain. Image Segmentation by Figure-Ground Composition into Maximal Cliques Adrian Ion∗, Joao Carreira, Cristian Sminchises](https://www.pdfsearch.io/img/80302da0b067f7e16a968abd1c346c47.jpg) | Add to Reading ListSource URL: www.eecs.berkeley.eduLanguage: English - Date: 2014-06-04 23:25:00
|
---|
73![NP-complete problems / Clique / Network coding / Shortest path problem / Maximal independent set / Path decomposition / Graph theory / Theoretical computer science / Mathematics NP-complete problems / Clique / Network coding / Shortest path problem / Maximal independent set / Path decomposition / Graph theory / Theoretical computer science / Mathematics](/pdf-icon.png) | Add to Reading ListSource URL: www.comm.utoronto.caLanguage: English - Date: 2011-12-23 16:23:54
|
---|
74![Annals of Mathematics, [removed]), 439–485 On the hardness of approximating minimum vertex cover By Irit Dinur and Samuel Safra* Annals of Mathematics, [removed]), 439–485 On the hardness of approximating minimum vertex cover By Irit Dinur and Samuel Safra*](https://www.pdfsearch.io/img/9d96920f9113f630a90d45e2716162cc.jpg) | Add to Reading ListSource URL: www.wisdom.weizmann.ac.ilLanguage: English - Date: 2006-04-11 06:21:40
|
---|
75![doi:[removed]j.tcs[removed] doi:[removed]j.tcs[removed]](https://www.pdfsearch.io/img/384c893b2e50a4574776599f5fce7e1c.jpg) | Add to Reading ListSource URL: snap.stanford.eduLanguage: English - Date: 2011-11-19 02:39:01
|
---|
76![Data Mining and Knowledge Discovery in Dynamic Networks Panos M. Pardalos Center for Applied Optimization Dept. of Industrial & Systems Engineering Data Mining and Knowledge Discovery in Dynamic Networks Panos M. Pardalos Center for Applied Optimization Dept. of Industrial & Systems Engineering](https://www.pdfsearch.io/img/fd67cd8140a15abb06665bb6c665639d.jpg) | Add to Reading ListSource URL: www.eecs.harvard.eduLanguage: English - Date: 2006-10-30 15:12:10
|
---|
77![Maximal lattice-free convex sets in linear subspaces Amitabh Basu Carnegie Mellon University, [removed] Michele Conforti Universit`a di Padova, [removed] G´erard Cornu´ejols ∗ Maximal lattice-free convex sets in linear subspaces Amitabh Basu Carnegie Mellon University, [removed] Michele Conforti Universit`a di Padova, [removed] G´erard Cornu´ejols ∗](https://www.pdfsearch.io/img/d1197554e44353eb5d15a6531c9b14d0.jpg) | Add to Reading ListSource URL: integer.tepper.cmu.eduLanguage: English - Date: 2010-07-21 15:14:23
|
---|
78![A new trust region technique for the maximum weight clique problem Stanislav Busygin Industrial and Systems Engineering Department, University of Florida, 303 Weil Hall, Gainesville, FL 32611, USA A new trust region technique for the maximum weight clique problem Stanislav Busygin Industrial and Systems Engineering Department, University of Florida, 303 Weil Hall, Gainesville, FL 32611, USA](https://www.pdfsearch.io/img/aef5fbfc20f8d761170d655939b5aa88.jpg) | Add to Reading ListSource URL: www.stasbusygin.orgLanguage: English - Date: 2009-02-11 00:35:51
|
---|
79![A Simple Clique Camouflaging Against Greedy Maximum Clique Heuristics ∗ Stanislav Busygin [removed] http://www.stasbusygin.org A Simple Clique Camouflaging Against Greedy Maximum Clique Heuristics ∗ Stanislav Busygin [removed] http://www.stasbusygin.org](https://www.pdfsearch.io/img/3ad983fde25f2129ee5b2e084ed88e7c.jpg) | Add to Reading ListSource URL: www.stasbusygin.orgLanguage: English - Date: 2009-02-11 00:35:51
|
---|
80![General Conditions for Existence of Maximal Elements via the Uncovered Set John Duggan Working Paper No. 563 July 2011 General Conditions for Existence of Maximal Elements via the Uncovered Set John Duggan Working Paper No. 563 July 2011](https://www.pdfsearch.io/img/3eb0a713efe8c3acc21562042926efda.jpg) | Add to Reading ListSource URL: rcer.econ.rochester.eduLanguage: English - Date: 2011-09-10 11:05:00
|
---|